Locating Emergency Facilities Using the Weighted k-median Problem: A Graph-metaheuristic Approach
نویسندگان
چکیده
منابع مشابه
A hybrid metaheuristic approach for the capacitated p-median problem
The capacitated p-median problem (CPMP) seeks to obtain the optimal location of p medians considering distances and capacities for the services to be given by each median. This paper presents an efficient hybrid metaheuristic algorithm by combining a proposed cutting-plane neighborhood structure and a tabu search metaheuristic for the CPMP. In the proposed neighborhood structure to move from th...
متن کاملLocating tree-shaped facilities using the ordered median objective
In this paper we consider the location of a tree-shaped facility S on a tree network, using the ordered median function of the weighted distances to represent the total transportation cost objective. This function unifies and generalizes the most common criteria used in location modeling, e.g., median and center. If there are n demand points at the nodes of the tree T = (V ,E), this function is...
متن کاملSpatial Pattern Analysis for finding Weighted Candidate Set for p-median Problem inLocating Emergency Facilities
Facility location problems are well known problem in Industrial optimization. Locating emergency facility typically involves optimal location allocation of facilities with an objective to locate limited number of facilities such that the average response time is minimized. This paper describes an approach for finding a candidate set of emergency facility locations based on spat ial pattern anal...
متن کاملA population based hybrid metaheuristic for the p-median problem A population based hybrid metaheuristic for the p-median problem
The p-median problem is one of choosing p facilities from a set of candidates to satisfy the demands of n clients such that the overall cost is minimised. In this paper, PBS, a population based hybrid search algorithm for the p-median problem is introduced. The PBS algorithm uses a genetic algorithm based meta-heuristic, primarily based on cut and paste crossover operators, to generate new star...
متن کاملA Dependent LP-Rounding Approach for the k-Median Problem
In this paper, we revisit the classical k-median problem: Given n points in a metric space, select k centers so as to minimize the sum of distances of points to their closest center. Using the standard LP relaxation for k-median, we give an efficient algorithm to construct a probability distribution on sets of k centers that matches the marginals specified by the optimal LP solution. Our algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Periodica Polytechnica Civil Engineering
سال: 2017
ISSN: 1587-3773,0553-6626
DOI: 10.3311/ppci.10665